Extending partial tournaments
نویسندگان
چکیده
منابع مشابه
Extending partial tournaments
Let A be a (0, 1, ∗)-matrix with main diagonal all 0’s and such that if ai,j = 1 or ∗ then aj,i = ∗ or 0. Underwhat conditions on the row sums, and or column sums, of A is it possible to change the ∗’s to 0’s or 1’s and obtain a tournament matrix (the adjacency matrix of a tournament) with a specified score sequence? We answer this question in the case of regular and nearly regular tournaments....
متن کاملMinimal extending sets in tournaments
In 2011, Brandt proposed a new tournament solution called the minimal extending set (ME). It was conjectured that ME satisfies a large number of desirable properties. In this paper, we non-constructively show that ME fails to satisfy most of these properties. However, no concrete examples of these violations are known and it appears that ME satisfies these properties for all practical purposes....
متن کاملPossible and necessary winners of partial tournaments
We study the problem of computing possible and necessary winners for partially specified weighted and unweighted tournaments. This problem arises naturally in elections with incompletely specified votes, partially completed sports competitions, and more generally in any scenario where the outcome of some pairwise comparisons is not yet fully known. We specifically consider a number of well-know...
متن کاملLandau's and Rado's Theorems and Partial Tournaments
Using Rado’s theorem for the existence of an independent transversal of family of subsets of a set on which a matroid is defined, we give a proof of Landau’s theorem for the existence of a tournament with a prescribed degree sequence. A similar approach is used to determine when a partial tournament can be extended to a tournament with a prescribed degree sequence. Mathematics Subject Classific...
متن کاملExtending partial combinatory algebras
We give a negative answer to the question whether every partial combinatory algebra can be completed. The explicit counterexample will be an intricately constructed term model, the construction and the proof that it works heavily depending on syntactic techniques. In particular, it is a nice example of reasoning with elementary diagrams and descendants. We also include a domain-theoretic proof ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical and Computer Modelling
سال: 2009
ISSN: 0895-7177
DOI: 10.1016/j.mcm.2008.12.015